Planning for Partially Observable, Non-Deterministic Domains
نویسندگان
چکیده
From 12.06.05 to 17.06.2005 the Dagstuhl Seminar 05241 Synthesis and Planning was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The rst section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
منابع مشابه
Bounded Branching and Modalities in Non-Deterministic Planning
We study the consequences on complexity that arise when bounds on the number of branch points on the solutions for non-deterministic planning problems are imposed as well as when modal formulae are introduced into the description language. New planning tasks, such as whether there exists a plan with at most k branch points for a fully (or partially) observable non-deterministic domain, and whet...
متن کاملComputing Contingent Plans via Fully Observable Non-Deterministic Planning
Planning with sensing actions under partial observability is a computationally challenging problem that is fundamental to the realization of AI tasks in areas as diverse as robotics, game playing, and diagnostic problem solving. Recent work on generating plans for partially observable domains has advocated for online planning, claiming that offline plans are often too large to generate. Here we...
متن کاملNon Deterministic Logic Programs
Non deterministic applications arise in many domains, including, stochastic optimization, multi-objectives optimization, stochastic planning, contingent stochastic planning, reinforcement learning, reinforcement learning in partially observable Markov decision processes, and conditional planning. We present a logic programming framework called non deterministic logic programs, along with a decl...
متن کاملTitle:clipp: Combining Logical Inference and Probabilistic Planning
Planning on mobile robots deployed in complex real-world application domains is a challenge because: (a) robots lack knowledge representation and common sense reasoning capabilities; and (b) observations from sensors are unreliable and actions performed by robots are non-deterministic. In this talk, I shall describe a hybrid framework named CLIPP that combines answer set programming (ASP) and h...
متن کاملExploiting Expert Knowledge in Factored POMDPs
Decision support in real-world applications is often challenging because one has to deal with large and only partially observable domains. In case of full observability, large deterministic domains are successfully tackled by making use of expert knowledge and employing methods like Hierarchical Task Network (HTN) planning. In this paper, we present an approach that transfers the advantages of ...
متن کامل